Search results for "Abstract interpretation"

showing 3 items of 3 documents

Backcalculation of airport pavement moduli and thickness using the Lévy Ant Colony Optimization Algorithm

2016

Interpretation of NDTdata is crucial in any Airport Pavement Management System (APMS), in order to implement strategies to maintain airport pavementssince they allow to estimate their remaining life and related maintenance needs and activities. In this paper, the AntColony Optimization algorithmwasused for backcalculation of pavement moduli from surface deflection data. The algorithm’s performances are illustrated and improvement in prediction quality is demonstrated both in terms of goodness of fitness and computational effort. Moreover, it is proved that the proposed algorithm is also able to predict layer thicknesses, taking into account their variation too.

Engineeringmoduli backcalculation0211 other engineering and technologies020101 civil engineering02 engineering and technologyheuristic algorithm.0201 civil engineeringModuliDeflection (engineering)Nondestructive testing021105 building & constructionSettore ICAR/04 - Strade Ferrovie Ed AeroportiGeneral Materials ScienceFWD dataCivil and Structural Engineeringbusiness.industryAnt colony optimization algorithmsPavement managementBuilding and ConstructionAbstract interpretationRemaining lifeNon Destructive TestingbusinessSettore ICAR/08 - Scienza Delle CostruzioniAlgorithmairport pavement
researchProduct

Verification of Well-Formed Communicating Recursive State Machines

2008

AbstractIn this paper we introduce a new (non-Turing equivalent) formal model of recursive concurrent programs called well-formed communicating recursive state machines (CRSM). CRSM extend recursive state machines (RSM) by allowing a restricted form of concurrency: a state of a module can be refined into a finite collection of modules (working in parallel) in a potentially recursive manner. Communication is only possible between the activations of modules invoked on the same fork. We study the model-checking problem of CRSM with respect to specifications expressed in a temporal logic that extends CaRet with a parallel operator (ConCaRet). We propose a decision algorithm that runs in time ex…

Model checkingModel checkingTheoretical computer scienceGeneral Computer ScienceComputer scienceInfinite state systemModuloConcurrencyTree automataTheoretical Computer ScienceFormal models of concurrency and recursionTuring machinesymbols.namesakeFormal specificationTemporal logicContext-free specificationsRecursionLinear-time logicsPushdown systemsAbstract interpretationAutomatonTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESInfinite-state systemsrecursive state machinesymbolsState (computer science)Linear time logicAlgorithmComputer Science(all)
researchProduct

Sound and reusable components for abstract interpretation

2019

Abstract interpretation is a methodology for defining sound static analysis. Yet, building sound static analyses for modern programming languages is difficult, because these static analyses need to combine sophisticated abstractions for values, environments, stores, etc. However, static analyses often tightly couple these abstractions in the implementation, which not only complicates the implementation, but also makes it hard to decide which parts of the analyses can be proven sound independently from each other. Furthermore, this coupling makes it hard to combine soundness lemmas for parts of the analysis to a soundness proof of the complete analysis. To solve this problem, we propose to c…

SoundnessComputer scienceProgramming language020207 software engineering02 engineering and technologyStatic analysisReaching definitionReusecomputer.software_genreAbstract interpretation020204 information systems0202 electrical engineering electronic engineering information engineeringArrowHaskellSafety Risk Reliability and QualitycomputerSoftwarecomputer.programming_languageTransformer (machine learning model)Proceedings of the ACM on Programming Languages
researchProduct